Maximal planar graphs of inscribable type and diagonal flips
نویسندگان
چکیده
منابع مشابه
Maximal planar graphs and diagonal operations
Maximal planar graphs embed in the euclidean plane as plane triangulations. Two such plane triangulations are equivalent if there is a homeomorphism of the plane which maps the vertices, edges and faces of one onto the corresponding elements of the other. A diagonal operation on a plane triangulation deletes an appropriate edge and inserts a related edge. We prove constructively that, given any...
متن کاملDiagonal Flips in Labelled Planar Triangulations
A classical result of Wagner states that any two (unlabelled) planar triangulations with the same number of vertices can be transformed into each other by a finite sequence of diagonal flips. Recently Komuro gives a linear bound on the maximum number of diagonal flips needed for such a transformation. In this paper we show that any two labelled triangulations can be transformed into each other ...
متن کاملSigned Diagonal Flips
We introduce the notion of signed diagonal flips on signed surface tri-angulations. We then formulate the conjecture that any two triangulations (without interior vertices) of a given polygon may be transformed into each other by a signable sequence of diagonal flips. Finally, we explain how this conjecture implies the four color theorem.
متن کاملSpanning Maximal Planar Subgraphs of Random Graphs
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
متن کاملOn properties of maximal 1-planar graphs
A graph is called 1-planar if there exists a drawing in the plane so that each edge contains at most one crossing. We study maximal 1-planar graphs from the point of view of properties of their diagrams, local structure and hamiltonicity.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.01.038